Generalized Flow and Determinism in Measurement-based Quantum Computation

We extend the notion of quantum information flow defined by Danos and Kashefi [1] for the one-way model [2] and present a necessary and sufficient condition for the deterministic computation in this model. The generalized flow also applied in the extended model with measurements in the (X,Y ), (X,Z) and (Y, Z) planes. We apply both measurement calculus and the stabiliser formalism to derive our main theorem which for the first time gives a full characterization of the deterministic computation in the one-way model. We present several examples to show how our result improves over the traditional notion of flow, such as geometries (entanglement graph with input and output) with no flow but having generalized flow and we discuss how they lead to an optimal implementation of the unitaries. More importantly one can also obtain a better quantum computation depth with the generalized flow rather than with flow. We believe our characterization result is particularly essential for the study of the algorithms and complexity in the one-way model. Generalized Flow and Determinism 2